Complexity classes - PDFSEARCH.IO - Document Search Engine

Complexity classes
Results: 1120

#	Item
871	7. Complexity: P & NP Optimization Problems find an optimal solution, most common in praxis implies Add to Reading List Source URL: www.jn.inf.ethz.ch Language: English - Date: 2005-11-28 16:45:16 Complexity classes NP P versus NP problem Boolean satisfiability problem P Time complexity Optimization problem Reduction Cook–Levin theorem Theoretical computer science Computational complexity theory Applied mathematics
872	EUROPA - Agricultural statistics Add to Reading List Source URL: ec.europa.eu Language: English - Date: 2007-03-01 04:58:34 Complexity classes NP P
873	EUROPA - Agricultural statistics Add to Reading List Source URL: ec.europa.eu Language: English - Date: 2007-03-01 04:58:34 Complexity classes NP P
874	EUROPA - Agricultural statistics Add to Reading List Source URL: ec.europa.eu Language: English - Date: 2007-03-01 04:58:34 Complexity classes NP P
875	Separation of NP-completeness Notions A. Pavan Alan L Selman ∗ Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2001-03-30 11:54:28 Complexity classes Models of computation Computability theory Mathematical optimization NP Time complexity Oracle machine P Turing machine Theoretical computer science Computational complexity theory Applied mathematics
876	Complexity of fuzzy answer set programming under Lukasiewicz semantics Marjon Blondeela,1 , Steven Schockaertb , Dirk Vermeira , Martine De Cockc a Vrije Universiteit Brussel, Department of Computer Science, Pleinlaan 2 Add to Reading List Source URL: www.cwi.ugent.be Language: English - Date: 2013-10-21 12:32:43 Logic programming Logic in computer science Non-classical logic Structural complexity theory Complexity classes Stable model semantics Answer set programming Fuzzy logic Negation Theoretical computer science Applied mathematics Mathematics
877	Properties of NP-Complete Sets Christian Glaßer, A. Pavan, Alan L. Selman, Samik Sengupta ∗ † Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2004-01-15 13:02:20 Complexity classes NP P versus NP problem PP Sparse language P Cook–Levin theorem NP-hard Theoretical computer science Computational complexity theory Applied mathematics
878	Reductions between Disjoint NP-Pairs Christian Glaßer ∗ ¨ Informatik IV Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2003-04-21 14:49:45 Computability theory Structural complexity theory Complexity classes Mathematical optimization NP-complete P versus NP problem Turing reduction Oracle machine Time complexity Theoretical computer science Computational complexity theory Applied mathematics
879	October 31, 2007 CURRICULUM VITAE ALAN L. SELMAN Department of Computer Science and Engineering University at Buffalo 201 Bell Hall Add to Reading List Source URL: www.cse.buffalo.edu Language: English - Date: 2007-11-06 15:06:02 Computational complexity theory NP-complete ACM SIGACT Sparse language PH Polynomial hierarchy Computer science FL International Colloquium on Automata Languages and Programming Theoretical computer science Applied mathematics Complexity classes
880	Complexity of fuzzy answer set programming under Lukasiewicz semantics: First results Marjon Blondeel1 ? , Steven Schockaert2 ?? , Martine De Cock2 , and Dirk Vermeir1 1 Add to Reading List Source URL: www.cwi.ugent.be Language: English - Date: 2012-01-17 09:39:13 Logic programming Logic in computer science Non-classical logic Mathematical optimization Stable model semantics Answer set programming Fuzzy logic NP Computational complexity theory Theoretical computer science Applied mathematics Complexity classes

UPDATE